Testing the Integrity of Non-monotonic Knowledge Bases Containing Semi-Normal Defaults

نویسنده

  • Neli Zlatareva
چکیده

This paper presents a methodology for testing general non-monotonic knowledge bases for logical and semantic inconsistencies. It extends the CTMS-based verification framework introduced in our previous work with an additional integrity test. This test aims to ensure that a logically consistent non-monotonic knowledge base is also free of semantic inconsistencies, resulted from violated integrity constraints. Generally, semantic inconsistencies are detected during dynamic validation of the KBS. We argue, however, that some types of semantic inconsistencies can be explicated during the formal V&V analysis, and we describe a logical procedure that carries out this validation task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying OWL 2 QL and Non-monotonic Rules

Answering (conjunctive) queries is an important reasoning task in Description Logics (DL), hence also in highly expressive ontology languages, such as OWL. Extending such ontology languages with rules, such as those expressible in RIF-Core, and further with non-monotonic rules, integrating default negation as described in the RIF-FLD, yields an even more expressive language that allows for mode...

متن کامل

FLARE: Induction with Prior Knowledge

This paper discusses a general framework called FLARE, that integrates inductive learning using prior knowledge together with reasoning in a non-recursive, propositional setting. FLARE learns incrementally by continually revising its knowledge base in the light of new evidence. Prior knowledge is generally given by a teacher and takes the form of pre-encoded rules. Simple defaults, combined wit...

متن کامل

Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics

In this paper we propose a mapping between inconsistent ontological knowledge bases and semi-monotonic, prerequisite-free closed normal default theories. As a proof of concept of the new results obtained by the proposed mapping we introduce an any-time algorithm for query answering that starts off by a small set of facts and incrementally adds to this set.

متن کامل

Learning Action Descriptions with A-Prolog: Action Language C

This paper demonstrates how A-Prolog can be used to solve the problem of non-monotonic inductive learning in the context of the learning of the behavior of dynamic domains. Non-monotonic inductive learning is an extension of traditional inductive learning, characterized by the use of default negation in the background knowledge and/or in the clauses being learned. The importance of non-monotoni...

متن کامل

From Query Answering to Satissability in Nonmonotonic Logics

We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specii-cally, we study the relationship between satis-ability and logical implication in nonmono-tonic logics, showing that, in many nonmono-tonic formalisms, it is possible and easy to reduce logical implication to satissability. This result not only allows for establishin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004